Efficient reallocation under additive and responsive preferences

Optimal Reallocation under Additive and Ordinal Preferences

Reallocating resources to get mutually beneficial outcomes is a fundamental problem in various multi-agent settings. In the first part of the paper we focus on the setting in which agents express additive cardinal utilities over objects. We present computational hardness results as well as polynomial-time algorithms for testing Pareto optimality under different restrictions such as two utility ...

Target setting in additive models with preferences and interval data

Efficient Register Assignment through Reallocation

In modern superscalar microarchitectures, access to register file lies on the critical schedule-to-execute path, necessitating smaller files in order to achieve higher clock frequencies. In this paper, we propose innovative register allocation mechanisms to increase the parallelism exploited from smaller register files. Our techniques introduce write-afterread dependencies to facilitate registe...

Additive - Belief - Based Preferences ∗

We introduce a new class of preferences — which we call additive-belief-based (ABB) utility — that captures a general, but still tractable, approach to belief-based utility, and that encompasses many popular models in the behavioral literature. We axiomatize a general class of ABB preferences, as well as two prominent special cases that allow utility to depend on the level of each period’s beli...

Efficient and Stable Collective Choices under Crowding Preferences

We consider a set of agents who have to choose one alternative among a finite set of social alternatives. A final allocation is a pair given by the selected alternative and the group of its users. Agents have crowding preferences over allocations: between any pair of allocations with the same alternative, they prefer the allocation with the largest number of users. We require that a decision be...